Improving scheduling robustness via preprocessing and dynamic adaptation
نویسندگان
چکیده
ERHAN KUTANOGLU1 and S. DAVID WU2 1Operations Research and Industrial Engineering Graduate Program, Department of Mechanical Engineering, The University of Texas at Austin, 1 University Station C2200 ETC 5.160, Austin, TX 78712, USA E-mail: [email protected] 2Department of Industrial and Systems Engineering, Lehigh University, 200 W. Packer Ave., Bethlehem, PA 18015, USA E-mail: [email protected]
منابع مشابه
Improving Schedule Robustness via Stochastic Analysis and Dynamic Adaptation
We study methods that improve scheduling robustness under uncertain disturbances and dynamic shop conditions. A new method is proposed based on the notion of preprocessrst-schedule-later by Wu et al. [19]. Preprocessing starts at the beginning of the planning period where we use a Lagrangean Relaxation of the scheduling model to form networkstructured job subproblems. For each job subproblem we...
متن کاملSolving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملTowards improving ASR robustness for PSN and GSM telephone applications
In real-life applications, errors in the speech recognition system are mainly due to inefficient detection of speech Ž . segments, unreliable rejection of Out-Of-Vocabulary OOV words, and insufficient account of noise and transmission channel effects. In this paper, we review a set of techniques developed at CNET in order to increase the robustness to mismatches between training and testing con...
متن کاملA Holonic Approach to Dynamic Manufacturing Scheduling
Manufacturing scheduling is a complex combinatorial problem, particularly in distributed and dynamic environments. This paper presents a holonic approach to manufacturing scheduling, which in opposite to traditional approaches, distributes the scheduling functions over several entities, combining their calculation power and local optimization. In this scheduling and control approach, the schedu...
متن کاملA New Approach Generating Robust and Stable Schedules in m-Machine Flow Shop Scheduling Problems: A Case Study
This paper considers a scheduling problem with uncertain processing times and machine breakdowns in industriall/office workplaces and solves it via a novel robust optimization method. In the traditional robust optimization, the solution robustness is maintained only for a specific set of scenarios, which may worsen the situation for new scenarios. Thus, a two-stage predictive algorithm is prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004